Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities
نویسندگان
چکیده
In this paper, the maximum capacity path problem in time-varying network is presented, where waiting times at vertices are not allowable. Moreover, the capacities are considered the generalized trapezoidal fuzzy number. An exact algorithm is proposed which can find a optimal solution of problem subject to the time of path is at most T, where T is a given time horizon.
منابع مشابه
Approximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملRefueling problem of alternative fuel vehicles under intuitionistic fuzzy refueling waiting times: a fuzzy approach
Using alternative fuel vehicles is one of the ways to reduce the consumption of fossil fuels which have many negative environmental effects. An alternative fuel vehicle needs special planning for its refueling operations because of some reasons, e.g. limited number of refueling stations, uncertain refueling queue times in the stations, variable alternative fuel prices among the stations, etc. I...
متن کاملCapacity assignment in multiservice packet networks with soft maximum waiting time guarantees
We address the problem of capacity assignment in packet networks with soft maximum waiting time guarantees. We present a multi-level framework for designing and analyzing capacity assignment methods in multiservice networks. Moreover, we propose a novel capacity assignment method that provides a tradeoff between capacity requirements and quality for the voice traffic class. The proposed method ...
متن کاملNorwegian Priority Setting in Practice – an Analysis of Waiting Time Patterns Across Medical Disciplines
Background Different strategies for addressing the challenge of prioritizing elective patients efficiently and fairly have been introduced in Norway. In the time period studied, there were three possible outcomes for elective patients that had been through the process of priority setting: (i) high priority with assigned individual maximum waiting time; (ii) low priority without a maximum waitin...
متن کاملTime-varying shortest path problems with constraints
The shortest path problem is considered with yet another extension. The transit times b(x,y,u) and the arc costs c(x,y,u) on arc (x,y) vary as a function of the departure time u at the beginning vertex of the arc. The problem considered is to find the shortest path between a pair of nodes such that the total traverse time is lesser than some specified value T. Waiting times at nodes are conside...
متن کامل